Commitment-based device-pairing protocol with synchronized drawings and comparison metrics

This article presents a new method for pairing devices securely. The commitment-based authentication uses a fuzzy secret that the devices only know approximately. Its novel feature is time-based opening of commitments in a single round. We also introduce a new source for the fuzzy secret: synchronized drawing with two fingers of the same hand on two touch screens or surfaces. The drawings are encoded as strings and compared with an edit-distance metric. A prototype implementation of this surprisingly simple and natural pairing mechanism shows that it accurately differentiates between true positives and man-in-the-middle attackers.     

8096/8098单片机集成开发系统

本集成开发环境集编辑、编译、调试和运行于一体,模拟了MCS-96系列单片机的指令系统,并给教学、实验、应用、科研和单片机的开发提供了强有力的手段。     

A continuum-based modeling of MEMS devices for estimating their resonant frequencies

A continuum-based modeling of coupled electrostatics-structure interactions is presented for the frequency computations of MEMS devices. The present general formulation of electrostatics accounting for free space is validated first by specializing it to one-dimensional uniform motion of conducting surfaces and comparing the resulting electrostatics to conventional lumped models. The general coupled electrostatics-structure interactions are then applied for the prediction of resonant frequencies of MEMS devices due to bias-voltage changes and temperature variations. Comparisons of predicted resonant frequencies obtained by the present coupled electrostatics-structure interaction models with experimental results available in the literature demonstrate that the proposed continuum-based interaction modeling yields high-confidence predictions of resonant frequencies of MEMS devices.     

Mesh结构P/G布线网络层次化快速分析方法

本文提出了一个基于网络划分的P／G布线网络层次化快速分析方法。其中，对于子网运算，通过对Cholesky分解法三角化对称正定阵的图模型分析，并基于Mesh结构网络的自身特点，提出了一个基于图顶点排序的加速子网分析运算策略；并用基于MPI的并行结构实现了P／G布线网络分析的并行运算。     

Mesh Simplification Based on Super-Face and Genetic Algorithm in Reverse Engineering

Mesh simplification is one of the most important links in the context of reverse engineering. It is also an important consideration in computer graphics. This paper presents a novel and original method of triangular mesh reduction. A new concept of super-face is defined. In order to construct a super-face, a way to calculate the scattered point curvature is discussed. The growth of a seed point and the combination of different regions are also necessary for the construction of a super-face. When the hole left by the deletion of super-face is retriangulated a genetic algorithm is used that has been modified for our specific problem. Then the different weights to balance the optimisation of the new triangular mesh can be adjusted.     

Greedy hot-potato routing on the two-dimensional mesh

Summary We propose hot-potato (or, deflection) packet routing algorithms on the two-dimensional mesh. The algorithms are strongly greedy in the sense that they attempt to send packets in good directions whenever possible. Furthermore, the routing operations are simple and independent of the time that has elapsed. The first algorithm gives the best evacuation time known for delivering all the packets to their destinations. A batch ofk packets with maximal source-to-destination distanced _max is delivered in 2(k-1)+d _max. The second algorithm improves this bound tok+d _max when all packets are destined to the same node. This also implies a new bound for the multitarget case, which is the first to take into account the number of in-edges of a node. The third algorithm is designed for routing permutations with source-to-destination distance at most three, in which case the algorithm terminates in at most seven steps. We also show a lower bound of five steps for this problem. Ishai Ben-Aroya received the B.A. and M.Sc. in computer science from the Technion (Israel Institute of Technology). He is currently working with Microsoft Israel R&D group. His main interests include Routing Algorithms, Cryptography and Computer Security. Tamar Eilam received the B.A. degree in Computer Science from the Technion IIL in 1995, and is currently studying towards her M.A. degree. Assaf Schuster received his B.A., M.A. and Ph.D. degrees in Computer Science from the Hebrew University of Jerusalem (the last one in 1991). He is currently a lecturer at the Technion IIL. His main interests include Networks and Routing Algorithms, Parallel and Distributed Computation, Optical Computation and Communication, Dynamically Reconfiguring Networks, and Greedy Hot Potato Routing.This work was supported in part by the French-Israeli grant for cooperation in Computer Science, and by a grant from the Israeli Ministry of Science. An extended abstract appeared in proc. 2nd European Symposium on Algorithms, September 1994     

6LoWPAN在物联网中的应用仿真

提出了一种基于6LoWPAN的物联网总体方案,同时对协议中的Mesh字段进行了改进,然后在网络模拟环境下对本协议平均传输成功率、平均延迟时间的性能进行了比较分析,并在仿真环境中进行了实验验证工作。实验数据表明,改进后的协议具有更好的性能。     

无线Mesh网的物理层网络编码方案

无线网状网是传统组网方式的变革,网中的节点之间相互通信,构成多点到多点的网状结构,是一个大型的无线中继网络,对无线中继网络物理层的研究集中于网络编码,以及结合逼近香农极限的良好性能的低密度奇偶校验码,提出了基于物理层的结合网络编码和信道编码的方案,该方案不仅利用了双向中继的提升吞吐率的特性,而且设计了并行迭代算法来降低译码的复杂度。     

板料成形模拟后处理中的截面物理量的显示技术*

在自行开发的板料成形有限元后置处理系统FASTAMP_POST中,采用了动态获取截面物理量的算法,实现了截面物理量实时显示功能。该功能真实反映了网格物理量的大小及其变化趋势,具有原理简单、易实现、执行速度快的优点。